A Novel Practical Certificate-Less Digital Signing System Based on Super-Elliptic Bilinear Map Parings

نویسندگان

  • Wenxue Tan
  • Xiping Wang
چکیده

In this paper, we propose a novel practical Certificate-Less digital signing system based on bilinear map pairings defined on super elliptic curve, which is proved more efficiency than some similar systems pioneered heretofore as viewed from information security application widely applied in mobile-thin computation environment often with a narrow communication bandwidth concomitant. For a long span, the complex managing public key certificate job involved in crypto-system based on identity has been keeping from a more efficient digital signing and disturbing engineers engaging in designing secure mobile E-Commerce. By this scheme, signing subroutine can be in no need of pairscomputation, and verifying can be performed only at cost of 3 times pairs-computation while not introducing special hash function, a necessity in some similar schemes initiated in some references. With respect to security, the system manifests a satisfying immunity from Replacing Public Key Attack, Forging Signature Attack and some other typical attack methods from angle of computability of NP-problem and of provable security. By comparison and analysis in detail and in depth, it is made clear that the signing system can provide a favorable macro-availability and performance, and be fit to be promoted into the application of mobile ECommerce and some similar requirements.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bilinear Parings in Property-based attestation

One of the objectives of trusted computing is to provide remote attestation method that is able to confirm the status of remote platform or application. Existing property-based attestation is based on the strong-RSA assumption and the required key length is too long. What’s more, a considerable number of RSA-length operations having to be performed which lead to low computational efficiency. Bi...

متن کامل

An Efficient Proxy Signature Scheme Without Bilinear Pairings

A signature scheme is a method for signing a message stored in electronic form. As such, a signed message can be transmitted over a computer network in an authenticated manner. This paper introduces a digital signature scheme and a proxy digital signature scheme without bilinear pairings. Both schemes are based on the elliptic curve discrete logarithm problem (ECDLP). Both schemes achieve the s...

متن کامل

The new protocol blind digital signature based on the discrete logarithm problem on elliptic curve

In recent years it has been trying that with regard to the question of computational complexity of discrete logarithm more strength and less in the elliptic curve than other hard issues, applications such as elliptic curve cryptography, a blind  digital signature method, other methods such as encryption replacement DLP. In this paper, a new blind digital signature scheme based on elliptic curve...

متن کامل

An Efficient ID - based Proxy Blind Signature with Pairing - free Realization

Proxy blind Signature allows an original signer to delegate his/her signing capability to a proxy signer who performs message signing blindly on behalf of original signer but he cannot make any link between the blind signature and the identity of the message's owner. Using bilinear pairings, so many ID-based proxy blind signature (IDPBS) schemes have been proposed. But the computation cost of a...

متن کامل

A certificate-based proxy signature with message recovery without bilinear pairing

In this paper, we propose the first provable secure certificate-based proxy signature with message recovery without bilinear pairing. The notion of certificate-based cryptography was initially introduced by Gentry in 2003, in order to simplify certificate management in traditional public key cryptography (PKC) and to solve the key escrow problem in identity-based cryptosystems. To date, a numbe...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • JSW

دوره 6  شماره 

صفحات  -

تاریخ انتشار 2011